Artifact analysis of approximate helical cone-beam CT reconstruction algorithms.

نویسندگان

  • Th Köhler
  • R Proksa
  • C Bontus
  • M Grass
  • J Timmer
چکیده

In this paper, four approximate cone-beam CT reconstruction algorithms are compared: Advanced single slice rebinning (ASSR) as a representative of algorithms employing a two dimensional approximation, PI, PI-SLANT, and 3-PI which all use a proper three dimensional back-projection. A detailed analysis of the image artifacts produced by these techniques shows that aliasing in the z-direction is the predominant source of artifacts for a 16-row scanner with 1.25 mm nominal slice thickness. For a detector with isotropic resolution of 0.5 mm, we found that ASSR and PI produce different kinds of artifacts which are almost at the same level, while PI-SLANT produces none of these artifacts. It is shown that the use of redundant data in the 3-PI method suppresses aliasing artifacts efficiently for both scanners.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Artifact reduction techniques in Cone Beam Computed Tomography (CBCT) imaging modality

Introduction: Cone beam computed tomography (CBCT) was introduced and became more common based on its low cost, fast image procedure rate and low radiation dose compared to CT. This imaging modality improved diagnostic and treatment-planning procedures by providing three-dimensional information with greatly reduced level of radiation dose compared to 2D dental imaging modalitie...

متن کامل

Simple Quasi-Exact Filtered Backprojection Algorithms for Long-Object Problem in Helical Cone-Beam Tomography

Since the development of multi-slice helical CT, cone-beam reconstruction with a helical vertex path is receiving increasing attention. The current multi-slice CT scanners are adopting a class of approximate reconstruction algorithms which can be viewed an extension of the 2-D FBP algorithm. However, these approximate algorithms break down as the pitch of helix becomes large. In fact, major com...

متن کامل

Review of Recent Developments in Cone-beam Ct Reconstruction Algorithms for Long-object Problem

Long-object problem and short-object problem both deal with reconstruction problems with truncated conebeam CT projections acquired with a helical path. They have significantly less practical limitations than original exact cone-beam CT reconstruction algorithms which the cone-beam must cover the whole object. The short-object problem can be defined as reconstruction of the whole object having ...

متن کامل

Exact and approximate algorithms for helical cone-beam CT.

This paper concerns image reconstruction for helical x-ray transmission tomography (CT) with multi-row detectors. We introduce two approximate cone-beam (CB) filtered-backprojection (FBP) algorithms of the Feldkamp type, obtained by extending to three dimensions (3D) two recently proposed exact FBP algorithms for 2D fan-beam reconstruction. The new algorithms are similar to the standard Feldkam...

متن کامل

PI-line-based image reconstruction in helical cone-beam computed tomography with a variable pitch.

Current applications of helical cone-beam computed tomography (CT) involve primarily a constant pitch where the translating speed of the table and the rotation speed of the source-detector remain constant. However, situations do exist where it may be more desirable to use a helical scan with a variable translating speed of the table, leading a variable pitch. One of such applications could aris...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Medical physics

دوره 29 1  شماره 

صفحات  -

تاریخ انتشار 2002